Weakly convex and weakly connected independent dominations in the corona of graphs
نویسندگان
چکیده
منابع مشابه
On weakly connected domination in graphs
Let G = (V,E) be a connected undirected graph. For any vertex v ∈ V , the closed neighborhood of v is N [v] = {v} ∪ {u ∈ V | uv ∈ E }. For S ⊆ V , the closed neighborhood of S is N [S] = ⋃ v∈S N [v]. The subgraph weakly induced by S is 〈S〉w = (N [S], E ∩ (S × N [S])). A set S is a weakly-connected dominating set of G if S is dominating and 〈S〉w is connected. The weakly-connected domination numb...
متن کاملA characterization of weakly four-connected graphs
A graph G = (V, E) is called weakly four-connected if G is 4-edge-connected and G − x is 2-edge-connected for all x ∈ V . We give sufficient conditions for the existence of ‘splittable’ vertices of degree four in weakly four-connected graphs. By using these results we prove that every minimally weakly fourconnected graph on at least four vertices contains at least three ‘splittable’ vertices of...
متن کاملStrong weakly connected domination subdivisible graphs
The weakly connected domination subdivision number sdγw(G) of a connected graph G is the minimum number of edges which must be subdivided (where each edge can be subdivided at most once) in order to increase the weakly connected domination number. The graph is strongγw-subdivisible if for each edge uv ∈ E(G) we have γw(Guv) > γw(G), where Guv is a graph G with subdivided edge uv. The graph is s...
متن کاملWeakly connected domination subdivision numbers
A set D of vertices in a graph G = (V, E) is a weakly connected dominating set of G if D is dominating in G and the subgraph weakly induced by D is connected. The weakly connected domination number of G is the minimum cardinality of a weakly connected dominating set of G. The weakly connected domination subdivision number of a connected graph G is the minimum number of edges that must be subdiv...
متن کاملGenerating weakly 4-connected matroids
We prove that, if M is a weakly 4-connected matroid with |E(M)| 7 and neither M nor M∗ is isomorphic to the cycle matroid of a ladder, then M has a proper minor M ′ such that M ′ is weakly 4-connected and |E(M ′)| |E(M)| − 2 unless M is some 12-element matroid with a special structure. © 2007 Elsevier Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematical Forum
سال: 2013
ISSN: 1314-7536
DOI: 10.12988/imf.2013.37131